Using Quasi-Newton methods for kidney modelling equations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization

Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.

متن کامل

Inexact Quasi-Newton methods for sparse systems of nonlinear equations

In this paper we present the results obtained in solving consistent sparse systems of n nonlinear equations F (x) = 0; by a Quasi-Newton method combined with a p block iterative row-projection linear solver of Cimmino-type, 1 p n: Under weak regularity conditions for F; it is proved that this Inexact Quasi-Newton method has a local, linear convergence in the energy norm induced by the precondit...

متن کامل

Inexact Block Quasi - Newton Methods for Sparsesystems of Nonlinear Equations

In this paper we present the results obtained in solving consistent sparse systems of n nonlinear equations F(x) = 0; by a Quasi-Newton method combined with a p block iterative row-projection linear solver of Cimmino-type, 1 p n: Under weak regularity conditions for F; it is proved that this Inexact Quasi-Newton method has a local, linear convergence in the energy norm induced by the preconditi...

متن کامل

Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems

The paper presents concrete realizations of quasi-Newton methods for solving several standard problems including complementarity problems, special variational inequality problems, and the Karush–Kuhn–Tucker (KKT) system of nonlinear programming. A new approximation idea is introduced in this paper. The Q-superlinear convergence of the Newton method and the quasiNewton method are established und...

متن کامل

Proximal Quasi-Newton Methods for Convex Optimization

In [19], a general, inexact, e cient proximal quasi-Newton algorithm for composite optimization problems has been proposed and a sublinear global convergence rate has been established. In this paper, we analyze the convergence properties of this method, both in the exact and inexact setting, in the case when the objective function is strongly convex. We also investigate a practical variant of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1990

ISSN: 0893-9659

DOI: 10.1016/0893-9659(90)90022-4